Convergence Improvement of Reliability-Based MultiobjectiveOptimization Using Hybrid MOPSO

نویسندگان

  • Shoichiro KAWAJI
  • Nozomu Kogiso
چکیده

1. Abstract This study proposes the improvement method of computational efficiency for the hybrid-type multiobjective particle swarm optimization method (MOPSO) that the authors developed for the reliability-based multiobjective optimization (RBMO). The hybrid MOPSO integrates the constraint satisfaction technique using gradient information of constraints with a concept of the single-loop-single-vector method (SLSV). The constraint satisfaction technique consists of two functions: moving the design candidate with constraint violation to the feasible region based on the sensitivity of the violated constraints and to the feasible boundary using bi-section method. Some design candidates, however, take much computation with zigzag iterations until the candidate moves to feasible region. This study proposes the improvement method by eliminating the zigzag iterations based on an idea from the modified SLSV method or the conjugate mean value method proposed for resolving the convergence problem for the reliability-based optimization. The efficiency of the proposed method is demonstrated through several design problems by investigating the convergence and diversity of finding Pareto optimal solutions. 2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Economic-Statistical Design of Simple Linear Profiles Using a Hybrid Approach of Data Envelopment Analysis, Taguchi Loss Function, and MOPSO

Statistically constrained economic design for profiles usually refers to the selection of some parameters such as the sample size, sampling interval, smoothing constant, and control limit for minimizing the total implementation cost while the designed profiles demonstrate a proper statistical performance. In this paper, the Lorenzen-Vance function is first used to model the implementation...

متن کامل

Entropy Diversity in Multi-Objective Particle Swarm Optimization

Multi-objective particle swarm optimization (MOPSO) is a search algorithm based on social behavior. Most of the existing multi-objective particle swarm optimization schemes are based on Pareto optimality and aim to obtain a representative non-dominated Pareto front for a given problem. Several approaches have been proposed to study the convergence and performance of the algorithm, particularly ...

متن کامل

Probabilistic Performance Reliabiilty-cost Tradeoff for Maintenance Strategy

Maintenance strategies are typically implemented by optimizing only the cost whilst the reliability of facility performance is neglected. This study proposes a novel algorithm using multi-objective particle swarm optimization (MOPSO) technique to evaluate the cost-reliability tradeoff in a flexible maintenance strategy based on non-dominant solutions. Moreover, a probabilistic model for regress...

متن کامل

A Multi-objective Evolutionary Hybrid Optimizer

A new hybrid multi-objective, multivariable optimizer utilizing Strength Pareto Evolutionary Algorithm (SPEA), Non-dominated Sorting Differential Evolution (NSDE), and Multi-Objective Particle Swarm (MOPSO) has been created and tested. The optimizer features automatic switching among these algorithms to expedite the convergence of the optimal Pareto front in the objective function(s) space. The...

متن کامل

A Hybrid Algorithm for Optimal Location and Sizing of Capacitors in the presence of Different Load Models in Distribution Network

In practical situations, distribution network loads are the mixtures of residential, industrial, and commercial types. This paper presents a hybrid optimization algorithm for the optimal placement of shunt capacitor banks in radial distribution networks in the presence of different voltage-dependent load models. The algorithm is based on the combination of Genetic Algorithm (GA) and Binary Part...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013